Short-term generation planning by primal and dual decomposition techniques
نویسندگان
چکیده
منابع مشابه
Long-term Planning by Short-term Prediction
We consider planning problems, that often arise in autonomous driving applications, in which an agent should decide on immediate actions so as to optimize a long term objective. For example, when a car tries to merge in a roundabout it should decide on an immediate acceleration/braking command, while the long term effect of the command is the success/failure of the merge. Such problems are char...
متن کاملPrimal-dual algorithms for audio decomposition using mixed norms
We consider the problem of decomposing audio into components that have different time frequency characteristics. For this, we model the components using different transforms and mixed norms. While recent works concentrate on the synthesis prior formulation, we consider both the analysis and synthesis prior formulations. We derive algorithms for both formulations through a primal-dual framework....
متن کاملAsynchronous block-iterative primal-dual decomposition methods for monotone inclusions
We propose new primal-dual decomposition algorithms for solving systems of inclusions involving sums of linearly composed maximally monotone operators. The principal innovation in these algorithms is that they are block-iterative in the sense that, at each iteration, only a subset of the monotone operators needs to be processed, as opposed to all operators as in established methods. Determinist...
متن کاملA strongly convergent primal-dual method for nonoverlapping domain decomposition
We propose a primal-dual parallel proximal splitting method for solving domain decomposition problems for partial differential equations. The problem is formulated via minimization of energy functions on the subdomains with coupling constraints which model various properties of the solution at the interfaces. The proposed method can handle a wide range of linear and nonlinear problems, with fle...
متن کاملA Primal-Dual Decomposition Algorithm for Multistage Stochastic Convex Programming
This paper presents a new and high performance solution method for multistage stochastic convex programming. Stochastic programming is a quantitative tool developed in the field of optimization to cope with the problem of decision-making under uncertainty. Among others, stochastic programming has found many applications in finance, such as asset-liability and bond-portfolio management. However,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: DYNA
سال: 2015
ISSN: 2346-2183,0012-7353
DOI: 10.15446/dyna.v82n191.51147